Incomparability graphs of (3 + 1)-free posets are s-positive
نویسندگان
چکیده
منابع مشابه
Cover-Incomparability Graphs of Posets
∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bilateral India-Slovenia grants BI-IN/06-07-002 and DST/INT/SLOV-P03/05, respectively.
متن کاملA characterization of a pomonoid $S$ all of its cyclic $S$-posets are regular injective
This work is devoted to give a charcaterization of a pomonoid $S$ such that all cyclic $S$-posets are regular injective.
متن کاملStructure and enumeration of ( 3 + 1 ) - free posets ( extended
A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3 + 1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have enumerated graded (3+1)-free posets, but until now the general enumeration problem has remained open. We enumerate all (3 + 1)-free posets by giving a decomposit...
متن کاملStructure and Enumeration of (3 + 1)-free Posets
A poset is (3 + 1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3 + 1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated (3+1)-free posets in the graded case by decomposing them into bipartite graphs, but until now the general enumeration problem has remained open. We give a f...
متن کاملTriangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs
A graph G = (V,E) is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each vertex u ′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax in T . Here, dT (u, v) denotes the distance between u and v in T , which is the sum of the weights of the edges ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)83014-7